Aleph–zero categorical Stone algebras

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stone Algebras

A range of algebras between lattices and Boolean algebras generalise the notion of a complement. We develop a hierarchy of these pseudo-complemented algebras that includes Stone algebras. Independently of this theory we study filters based on partial orders. Both theories are combined to prove Chen and Grätzer’s construction theorem for Stone algebras. The latter involves extensive reasoning ab...

متن کامل

Completing Categorical Algebras

Let Σ be a ranked set. A categorical Σ-algebra, cΣa for short, is a small category C equipped with a functor σC : C n //C, for each σ ∈ Σn, n ≥ 0. A continuous categorical Σ-algebra is a cΣa which has an initial object and all colimits of ω-chains, i.e., functors N //C; each functor σC preserves colimits of ω-chains. (N is the linearly ordered set of the nonnegative integers considered as a cat...

متن کامل

Stone-Kleene Relation Algebras

We develop Stone-Kleene relation algebras, which expand Stone relation algebras with a Kleene star operation to describe reachability in graphs. We show that finite matrices over extended real numbers form an instance. These theories are being prepared for the Archive of Formal Proofs. Further documentation will be added.

متن کامل

Kleene and Stone Algebras

Boolean algebras are affine complete by a well-known result of G. Grätzer. Various generalizations of this result have been obtained. Among them, a characterization of affine complete Stone algebras having a smallest dense element was given by R. Beazer. In this paper, generalizations of Beazer’s result are presented for algebras abstracting simultaneously Kleene and Stone algebras.

متن کامل

Stone Relation Algebras

We develop Stone relation algebras, which generalise relation algebras by replacing the underlying Boolean algebra structure with a Stone algebra. We show that finite matrices over bounded linear orders form an instance. As a consequence, relation-algebraic concepts and methods can be used for reasoning about weighted graphs. We also develop a fixpoint calculus and apply it to compare different...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Australian Mathematical Society

سال: 1978

ISSN: 1446-7887,1446-8107

DOI: 10.1017/s1446788700011861